<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en_US" lang="en_US">
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<title>Tree xref</title>
<link type="text/css" rel="stylesheet" href="../../../../../../stylesheet.css" />
</head>
<body>
<div id="overview"><a href="../../../../../../../api/org/jboss/netty/util/internal/jzlib/Tree.html">View Javadoc</a></div><pre>

<a class="jxr_linenumber" name="1" href="#1">1</a>   <em class="jxr_comment">/*</em>
<a class="jxr_linenumber" name="2" href="#2">2</a>   <em class="jxr_comment"> * Copyright 2009 Red Hat, Inc.</em>
<a class="jxr_linenumber" name="3" href="#3">3</a>   <em class="jxr_comment"> *</em>
<a class="jxr_linenumber" name="4" href="#4">4</a>   <em class="jxr_comment"> * Red Hat licenses this file to you under the Apache License, version 2.0</em>
<a class="jxr_linenumber" name="5" href="#5">5</a>   <em class="jxr_comment"> * (the "License"); you may not use this file except in compliance with the</em>
<a class="jxr_linenumber" name="6" href="#6">6</a>   <em class="jxr_comment"> * License.  You may obtain a copy of the License at:</em>
<a class="jxr_linenumber" name="7" href="#7">7</a>   <em class="jxr_comment"> *</em>
<a class="jxr_linenumber" name="8" href="#8">8</a>   <em class="jxr_comment"> *    <a href="http://www.apache.org/licenses/LICENSE-2.0" target="alexandria_uri">http://www.apache.org/licenses/LICENSE-2.0</a></em>
<a class="jxr_linenumber" name="9" href="#9">9</a>   <em class="jxr_comment"> *</em>
<a class="jxr_linenumber" name="10" href="#10">10</a>  <em class="jxr_comment"> * Unless required by applicable law or agreed to in writing, software</em>
<a class="jxr_linenumber" name="11" href="#11">11</a>  <em class="jxr_comment"> * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT</em>
<a class="jxr_linenumber" name="12" href="#12">12</a>  <em class="jxr_comment"> * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.  See the</em>
<a class="jxr_linenumber" name="13" href="#13">13</a>  <em class="jxr_comment"> * License for the specific language governing permissions and limitations</em>
<a class="jxr_linenumber" name="14" href="#14">14</a>  <em class="jxr_comment"> * under the License.</em>
<a class="jxr_linenumber" name="15" href="#15">15</a>  <em class="jxr_comment"> */</em>
<a class="jxr_linenumber" name="16" href="#16">16</a>  <em class="jxr_comment">/*</em>
<a class="jxr_linenumber" name="17" href="#17">17</a>  <em class="jxr_comment">Copyright (c) 2000,2001,2002,2003 ymnk, JCraft,Inc. All rights reserved.</em>
<a class="jxr_linenumber" name="18" href="#18">18</a>  
<a class="jxr_linenumber" name="19" href="#19">19</a>  <em class="jxr_comment">Redistribution and use in source and binary forms, with or without</em>
<a class="jxr_linenumber" name="20" href="#20">20</a>  <em class="jxr_comment">modification, are permitted provided that the following conditions are met:</em>
<a class="jxr_linenumber" name="21" href="#21">21</a>  
<a class="jxr_linenumber" name="22" href="#22">22</a>  <em class="jxr_comment">  1. Redistributions of source code must retain the above copyright notice,</em>
<a class="jxr_linenumber" name="23" href="#23">23</a>  <em class="jxr_comment">     this list of conditions and the following disclaimer.</em>
<a class="jxr_linenumber" name="24" href="#24">24</a>  
<a class="jxr_linenumber" name="25" href="#25">25</a>  <em class="jxr_comment">  2. Redistributions in binary form must reproduce the above copyright</em>
<a class="jxr_linenumber" name="26" href="#26">26</a>  <em class="jxr_comment">     notice, this list of conditions and the following disclaimer in</em>
<a class="jxr_linenumber" name="27" href="#27">27</a>  <em class="jxr_comment">     the documentation and/or other materials provided with the distribution.</em>
<a class="jxr_linenumber" name="28" href="#28">28</a>  
<a class="jxr_linenumber" name="29" href="#29">29</a>  <em class="jxr_comment">  3. The names of the authors may not be used to endorse or promote products</em>
<a class="jxr_linenumber" name="30" href="#30">30</a>  <em class="jxr_comment">     derived from this software without specific prior written permission.</em>
<a class="jxr_linenumber" name="31" href="#31">31</a>  
<a class="jxr_linenumber" name="32" href="#32">32</a>  <em class="jxr_comment">THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED WARRANTIES,</em>
<a class="jxr_linenumber" name="33" href="#33">33</a>  <em class="jxr_comment">INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND</em>
<a class="jxr_linenumber" name="34" href="#34">34</a>  <em class="jxr_comment">FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL JCRAFT,</em>
<a class="jxr_linenumber" name="35" href="#35">35</a>  <em class="jxr_comment">INC. OR ANY CONTRIBUTORS TO THIS SOFTWARE BE LIABLE FOR ANY DIRECT, INDIRECT,</em>
<a class="jxr_linenumber" name="36" href="#36">36</a>  <em class="jxr_comment">INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT</em>
<a class="jxr_linenumber" name="37" href="#37">37</a>  <em class="jxr_comment">LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA,</em>
<a class="jxr_linenumber" name="38" href="#38">38</a>  <em class="jxr_comment">OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF</em>
<a class="jxr_linenumber" name="39" href="#39">39</a>  <em class="jxr_comment">LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING</em>
<a class="jxr_linenumber" name="40" href="#40">40</a>  <em class="jxr_comment">NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,</em>
<a class="jxr_linenumber" name="41" href="#41">41</a>  <em class="jxr_comment">EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</em>
<a class="jxr_linenumber" name="42" href="#42">42</a>  <em class="jxr_comment"> */</em>
<a class="jxr_linenumber" name="43" href="#43">43</a>  <em class="jxr_comment">/*</em>
<a class="jxr_linenumber" name="44" href="#44">44</a>  <em class="jxr_comment"> * This program is based on zlib-1.1.3, so all credit should go authors</em>
<a class="jxr_linenumber" name="45" href="#45">45</a>  <em class="jxr_comment"> * Jean-loup Gailly(jloup@gzip.org) and Mark Adler(madler@alumni.caltech.edu)</em>
<a class="jxr_linenumber" name="46" href="#46">46</a>  <em class="jxr_comment"> * and contributors of zlib.</em>
<a class="jxr_linenumber" name="47" href="#47">47</a>  <em class="jxr_comment"> */</em>
<a class="jxr_linenumber" name="48" href="#48">48</a>  
<a class="jxr_linenumber" name="49" href="#49">49</a>  <strong class="jxr_keyword">package</strong> org.jboss.netty.util.internal.jzlib;
<a class="jxr_linenumber" name="50" href="#50">50</a>  
<a class="jxr_linenumber" name="51" href="#51">51</a>  <strong class="jxr_keyword">final</strong> <strong class="jxr_keyword">class</strong> <a href="../../../../../../org/jboss/netty/util/internal/jzlib/Tree.html">Tree</a> {
<a class="jxr_linenumber" name="52" href="#52">52</a>      <em class="jxr_comment">// extra bits for each length code</em>
<a class="jxr_linenumber" name="53" href="#53">53</a>      <strong class="jxr_keyword">static</strong> <strong class="jxr_keyword">final</strong> <strong class="jxr_keyword">int</strong>[] extra_lbits = { 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2,
<a class="jxr_linenumber" name="54" href="#54">54</a>              2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0 };
<a class="jxr_linenumber" name="55" href="#55">55</a>  
<a class="jxr_linenumber" name="56" href="#56">56</a>      <em class="jxr_comment">// extra bits for each distance code</em>
<a class="jxr_linenumber" name="57" href="#57">57</a>      <strong class="jxr_keyword">static</strong> <strong class="jxr_keyword">final</strong> <strong class="jxr_keyword">int</strong>[] extra_dbits = { 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5,
<a class="jxr_linenumber" name="58" href="#58">58</a>              5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13 };
<a class="jxr_linenumber" name="59" href="#59">59</a>  
<a class="jxr_linenumber" name="60" href="#60">60</a>      <em class="jxr_comment">// extra bits for each bit length code</em>
<a class="jxr_linenumber" name="61" href="#61">61</a>      <strong class="jxr_keyword">static</strong> <strong class="jxr_keyword">final</strong> <strong class="jxr_keyword">int</strong>[] extra_blbits = { 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
<a class="jxr_linenumber" name="62" href="#62">62</a>              0, 0, 0, 2, 3, 7 };
<a class="jxr_linenumber" name="63" href="#63">63</a>  
<a class="jxr_linenumber" name="64" href="#64">64</a>      <strong class="jxr_keyword">static</strong> <strong class="jxr_keyword">final</strong> byte[] bl_order = { 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4,
<a class="jxr_linenumber" name="65" href="#65">65</a>              12, 3, 13, 2, 14, 1, 15 };
<a class="jxr_linenumber" name="66" href="#66">66</a>  
<a class="jxr_linenumber" name="67" href="#67">67</a>      <strong class="jxr_keyword">static</strong> <strong class="jxr_keyword">final</strong> byte[] _dist_code = { 0, 1, 2, 3, 4, 4, 5, 5, 6, 6, 6, 6, 7,
<a class="jxr_linenumber" name="68" href="#68">68</a>              7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10,
<a class="jxr_linenumber" name="69" href="#69">69</a>              10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11,
<a class="jxr_linenumber" name="70" href="#70">70</a>              11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12,
<a class="jxr_linenumber" name="71" href="#71">71</a>              12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
<a class="jxr_linenumber" name="72" href="#72">72</a>              12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13,
<a class="jxr_linenumber" name="73" href="#73">73</a>              13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13,
<a class="jxr_linenumber" name="74" href="#74">74</a>              13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14,
<a class="jxr_linenumber" name="75" href="#75">75</a>              14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
<a class="jxr_linenumber" name="76" href="#76">76</a>              14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
<a class="jxr_linenumber" name="77" href="#77">77</a>              14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
<a class="jxr_linenumber" name="78" href="#78">78</a>              14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
<a class="jxr_linenumber" name="79" href="#79">79</a>              15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
<a class="jxr_linenumber" name="80" href="#80">80</a>              15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
<a class="jxr_linenumber" name="81" href="#81">81</a>              15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
<a class="jxr_linenumber" name="82" href="#82">82</a>              15, 0, 0, 16, 17, 18, 18, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21,
<a class="jxr_linenumber" name="83" href="#83">83</a>              22, 22, 22, 22, 22, 22, 22, 22, 23, 23, 23, 23, 23, 23, 23, 23, 24,
<a class="jxr_linenumber" name="84" href="#84">84</a>              24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 25, 25,
<a class="jxr_linenumber" name="85" href="#85">85</a>              25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 26, 26, 26,
<a class="jxr_linenumber" name="86" href="#86">86</a>              26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26,
<a class="jxr_linenumber" name="87" href="#87">87</a>              26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 27, 27, 27, 27, 27,
<a class="jxr_linenumber" name="88" href="#88">88</a>              27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27,
<a class="jxr_linenumber" name="89" href="#89">89</a>              27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 28, 28, 28, 28, 28, 28, 28,
<a class="jxr_linenumber" name="90" href="#90">90</a>              28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
<a class="jxr_linenumber" name="91" href="#91">91</a>              28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
<a class="jxr_linenumber" name="92" href="#92">92</a>              28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
<a class="jxr_linenumber" name="93" href="#93">93</a>              28, 28, 28, 28, 28, 28, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,
<a class="jxr_linenumber" name="94" href="#94">94</a>              29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,
<a class="jxr_linenumber" name="95" href="#95">95</a>              29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,
<a class="jxr_linenumber" name="96" href="#96">96</a>              29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,
<a class="jxr_linenumber" name="97" href="#97">97</a>              29, 29 };
<a class="jxr_linenumber" name="98" href="#98">98</a>  
<a class="jxr_linenumber" name="99" href="#99">99</a>      <strong class="jxr_keyword">static</strong> <strong class="jxr_keyword">final</strong> byte[] _length_code = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 8, 9, 9,
<a class="jxr_linenumber" name="100" href="#100">100</a>             10, 10, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 15,
<a class="jxr_linenumber" name="101" href="#101">101</a>             15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17,
<a class="jxr_linenumber" name="102" href="#102">102</a>             17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19, 19, 19, 19,
<a class="jxr_linenumber" name="103" href="#103">103</a>             19, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20,
<a class="jxr_linenumber" name="104" href="#104">104</a>             21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 22,
<a class="jxr_linenumber" name="105" href="#105">105</a>             22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 23, 23,
<a class="jxr_linenumber" name="106" href="#106">106</a>             23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24,
<a class="jxr_linenumber" name="107" href="#107">107</a>             24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
<a class="jxr_linenumber" name="108" href="#108">108</a>             24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 25, 25, 25, 25, 25,
<a class="jxr_linenumber" name="109" href="#109">109</a>             25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25,
<a class="jxr_linenumber" name="110" href="#110">110</a>             25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 26, 26, 26, 26, 26, 26, 26,
<a class="jxr_linenumber" name="111" href="#111">111</a>             26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26,
<a class="jxr_linenumber" name="112" href="#112">112</a>             26, 26, 26, 26, 26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27, 27,
<a class="jxr_linenumber" name="113" href="#113">113</a>             27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27,
<a class="jxr_linenumber" name="114" href="#114">114</a>             27, 27, 27, 27, 27, 28 };
<a class="jxr_linenumber" name="115" href="#115">115</a> 
<a class="jxr_linenumber" name="116" href="#116">116</a>     <strong class="jxr_keyword">static</strong> <strong class="jxr_keyword">final</strong> <strong class="jxr_keyword">int</strong>[] base_length = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14,
<a class="jxr_linenumber" name="117" href="#117">117</a>             16, 20, 24, 28, 32, 40, 48, 56, 64, 80, 96, 112, 128, 160, 192,
<a class="jxr_linenumber" name="118" href="#118">118</a>             224, 0 };
<a class="jxr_linenumber" name="119" href="#119">119</a> 
<a class="jxr_linenumber" name="120" href="#120">120</a>     <strong class="jxr_keyword">static</strong> <strong class="jxr_keyword">final</strong> <strong class="jxr_keyword">int</strong>[] base_dist = { 0, 1, 2, 3, 4, 6, 8, 12, 16, 24, 32, 48,
<a class="jxr_linenumber" name="121" href="#121">121</a>             64, 96, 128, 192, 256, 384, 512, 768, 1024, 1536, 2048, 3072, 4096,
<a class="jxr_linenumber" name="122" href="#122">122</a>             6144, 8192, 12288, 16384, 24576 };
<a class="jxr_linenumber" name="123" href="#123">123</a> 
<a class="jxr_linenumber" name="124" href="#124">124</a>     <em class="jxr_comment">// Mapping from a distance to a distance code. dist is the distance - 1 and</em>
<a class="jxr_linenumber" name="125" href="#125">125</a>     <em class="jxr_comment">// must not have side effects. _dist_code[256] and _dist_code[257] are never</em>
<a class="jxr_linenumber" name="126" href="#126">126</a>     <em class="jxr_comment">// used.</em>
<a class="jxr_linenumber" name="127" href="#127">127</a>     <strong class="jxr_keyword">static</strong> <strong class="jxr_keyword">int</strong> d_code(<strong class="jxr_keyword">int</strong> dist) {
<a class="jxr_linenumber" name="128" href="#128">128</a>         <strong class="jxr_keyword">return</strong> dist &lt; 256? _dist_code[dist] : _dist_code[256 + (dist &gt;&gt;&gt; 7)];
<a class="jxr_linenumber" name="129" href="#129">129</a>     }
<a class="jxr_linenumber" name="130" href="#130">130</a> 
<a class="jxr_linenumber" name="131" href="#131">131</a>     <strong class="jxr_keyword">short</strong>[] dyn_tree; <em class="jxr_comment">// the dynamic tree</em>
<a class="jxr_linenumber" name="132" href="#132">132</a>     <strong class="jxr_keyword">int</strong> max_code; <em class="jxr_comment">// largest code with non zero frequency</em>
<a class="jxr_linenumber" name="133" href="#133">133</a>     <a href="../../../../../../org/jboss/netty/util/internal/jzlib/StaticTree.html">StaticTree</a> stat_desc; <em class="jxr_comment">// the corresponding static tree</em>
<a class="jxr_linenumber" name="134" href="#134">134</a> 
<a class="jxr_linenumber" name="135" href="#135">135</a>     <em class="jxr_comment">// Compute the optimal bit lengths for a tree and update the total bit length</em>
<a class="jxr_linenumber" name="136" href="#136">136</a>     <em class="jxr_comment">// for the current block.</em>
<a class="jxr_linenumber" name="137" href="#137">137</a>     <em class="jxr_comment">// IN assertion: the fields freq and dad are set, heap[heap_max] and</em>
<a class="jxr_linenumber" name="138" href="#138">138</a>     <em class="jxr_comment">//    above are the tree nodes sorted by increasing frequency.</em>
<a class="jxr_linenumber" name="139" href="#139">139</a>     <em class="jxr_comment">// OUT assertions: the field len is set to the optimal bit length, the</em>
<a class="jxr_linenumber" name="140" href="#140">140</a>     <em class="jxr_comment">//     array bl_count contains the frequencies for each bit length.</em>
<a class="jxr_linenumber" name="141" href="#141">141</a>     <em class="jxr_comment">//     The length opt_len is updated; static_len is also updated if stree is</em>
<a class="jxr_linenumber" name="142" href="#142">142</a>     <em class="jxr_comment">//     not null.</em>
<a class="jxr_linenumber" name="143" href="#143">143</a>     <strong class="jxr_keyword">private</strong> <strong class="jxr_keyword">void</strong> gen_bitlen(<a href="../../../../../../org/jboss/netty/util/internal/jzlib/Deflate.html">Deflate</a> s) {
<a class="jxr_linenumber" name="144" href="#144">144</a>         <strong class="jxr_keyword">short</strong>[] tree = dyn_tree;
<a class="jxr_linenumber" name="145" href="#145">145</a>         <strong class="jxr_keyword">short</strong>[] stree = stat_desc.<strong class="jxr_keyword">static</strong>_tree;
<a class="jxr_linenumber" name="146" href="#146">146</a>         <strong class="jxr_keyword">int</strong>[] extra = stat_desc.extra_bits;
<a class="jxr_linenumber" name="147" href="#147">147</a>         <strong class="jxr_keyword">int</strong> base = stat_desc.extra_base;
<a class="jxr_linenumber" name="148" href="#148">148</a>         <strong class="jxr_keyword">int</strong> max_length = stat_desc.max_length;
<a class="jxr_linenumber" name="149" href="#149">149</a>         <strong class="jxr_keyword">int</strong> h; <em class="jxr_comment">// heap index</em>
<a class="jxr_linenumber" name="150" href="#150">150</a>         <strong class="jxr_keyword">int</strong> n, m; <em class="jxr_comment">// iterate over the tree elements</em>
<a class="jxr_linenumber" name="151" href="#151">151</a>         <strong class="jxr_keyword">int</strong> bits; <em class="jxr_comment">// bit length</em>
<a class="jxr_linenumber" name="152" href="#152">152</a>         <strong class="jxr_keyword">int</strong> xbits; <em class="jxr_comment">// extra bits</em>
<a class="jxr_linenumber" name="153" href="#153">153</a>         <strong class="jxr_keyword">short</strong> f; <em class="jxr_comment">// frequency</em>
<a class="jxr_linenumber" name="154" href="#154">154</a>         <strong class="jxr_keyword">int</strong> overflow = 0; <em class="jxr_comment">// number of elements with bit length too large</em>
<a class="jxr_linenumber" name="155" href="#155">155</a> 
<a class="jxr_linenumber" name="156" href="#156">156</a>         <strong class="jxr_keyword">for</strong> (bits = 0; bits &lt;= JZlib.MAX_BITS; bits ++) {
<a class="jxr_linenumber" name="157" href="#157">157</a>             s.bl_count[bits] = 0;
<a class="jxr_linenumber" name="158" href="#158">158</a>         }
<a class="jxr_linenumber" name="159" href="#159">159</a> 
<a class="jxr_linenumber" name="160" href="#160">160</a>         <em class="jxr_comment">// In a first pass, compute the optimal bit lengths (which may</em>
<a class="jxr_linenumber" name="161" href="#161">161</a>         <em class="jxr_comment">// overflow in the case of the bit length tree).</em>
<a class="jxr_linenumber" name="162" href="#162">162</a>         tree[s.heap[s.heap_max] * 2 + 1] = 0; <em class="jxr_comment">// root of the heap</em>
<a class="jxr_linenumber" name="163" href="#163">163</a> 
<a class="jxr_linenumber" name="164" href="#164">164</a>         <strong class="jxr_keyword">for</strong> (h = s.heap_max + 1; h &lt; JZlib.HEAP_SIZE; h ++) {
<a class="jxr_linenumber" name="165" href="#165">165</a>             n = s.heap[h];
<a class="jxr_linenumber" name="166" href="#166">166</a>             bits = tree[tree[n * 2 + 1] * 2 + 1] + 1;
<a class="jxr_linenumber" name="167" href="#167">167</a>             <strong class="jxr_keyword">if</strong> (bits &gt; max_length) {
<a class="jxr_linenumber" name="168" href="#168">168</a>                 bits = max_length;
<a class="jxr_linenumber" name="169" href="#169">169</a>                 overflow ++;
<a class="jxr_linenumber" name="170" href="#170">170</a>             }
<a class="jxr_linenumber" name="171" href="#171">171</a>             tree[n * 2 + 1] = (<strong class="jxr_keyword">short</strong>) bits;
<a class="jxr_linenumber" name="172" href="#172">172</a>             <em class="jxr_comment">// We overwrite tree[n*2+1] which is no longer needed</em>
<a class="jxr_linenumber" name="173" href="#173">173</a> 
<a class="jxr_linenumber" name="174" href="#174">174</a>             <strong class="jxr_keyword">if</strong> (n &gt; max_code) {
<a class="jxr_linenumber" name="175" href="#175">175</a>                 <strong class="jxr_keyword">continue</strong>; <em class="jxr_comment">// not a leaf node</em>
<a class="jxr_linenumber" name="176" href="#176">176</a>             }
<a class="jxr_linenumber" name="177" href="#177">177</a> 
<a class="jxr_linenumber" name="178" href="#178">178</a>             s.bl_count[bits] ++;
<a class="jxr_linenumber" name="179" href="#179">179</a>             xbits = 0;
<a class="jxr_linenumber" name="180" href="#180">180</a>             <strong class="jxr_keyword">if</strong> (n &gt;= base) {
<a class="jxr_linenumber" name="181" href="#181">181</a>                 xbits = extra[n - base];
<a class="jxr_linenumber" name="182" href="#182">182</a>             }
<a class="jxr_linenumber" name="183" href="#183">183</a>             f = tree[n * 2];
<a class="jxr_linenumber" name="184" href="#184">184</a>             s.opt_len += f * (bits + xbits);
<a class="jxr_linenumber" name="185" href="#185">185</a>             <strong class="jxr_keyword">if</strong> (stree != <strong class="jxr_keyword">null</strong>) {
<a class="jxr_linenumber" name="186" href="#186">186</a>                 s.<strong class="jxr_keyword">static</strong>_len += f * (stree[n * 2 + 1] + xbits);
<a class="jxr_linenumber" name="187" href="#187">187</a>             }
<a class="jxr_linenumber" name="188" href="#188">188</a>         }
<a class="jxr_linenumber" name="189" href="#189">189</a>         <strong class="jxr_keyword">if</strong> (overflow == 0) {
<a class="jxr_linenumber" name="190" href="#190">190</a>             <strong class="jxr_keyword">return</strong>;
<a class="jxr_linenumber" name="191" href="#191">191</a>         }
<a class="jxr_linenumber" name="192" href="#192">192</a> 
<a class="jxr_linenumber" name="193" href="#193">193</a>         <em class="jxr_comment">// This happens for example on obj2 and pic of the Calgary corpus</em>
<a class="jxr_linenumber" name="194" href="#194">194</a>         <em class="jxr_comment">// Find the first bit length which could increase:</em>
<a class="jxr_linenumber" name="195" href="#195">195</a>         <strong class="jxr_keyword">do</strong> {
<a class="jxr_linenumber" name="196" href="#196">196</a>             bits = max_length - 1;
<a class="jxr_linenumber" name="197" href="#197">197</a>             <strong class="jxr_keyword">while</strong> (s.bl_count[bits] == 0) {
<a class="jxr_linenumber" name="198" href="#198">198</a>                 bits --;
<a class="jxr_linenumber" name="199" href="#199">199</a>             }
<a class="jxr_linenumber" name="200" href="#200">200</a>             s.bl_count[bits] --; <em class="jxr_comment">// move one leaf down the tree</em>
<a class="jxr_linenumber" name="201" href="#201">201</a>             s.bl_count[bits + 1] += 2; <em class="jxr_comment">// move one overflow item as its brother</em>
<a class="jxr_linenumber" name="202" href="#202">202</a>             s.bl_count[max_length] --;
<a class="jxr_linenumber" name="203" href="#203">203</a>             <em class="jxr_comment">// The brother of the overflow item also moves one step up,</em>
<a class="jxr_linenumber" name="204" href="#204">204</a>             <em class="jxr_comment">// but this does not affect bl_count[max_length]</em>
<a class="jxr_linenumber" name="205" href="#205">205</a>             overflow -= 2;
<a class="jxr_linenumber" name="206" href="#206">206</a>         } <strong class="jxr_keyword">while</strong> (overflow &gt; 0);
<a class="jxr_linenumber" name="207" href="#207">207</a> 
<a class="jxr_linenumber" name="208" href="#208">208</a>         <strong class="jxr_keyword">for</strong> (bits = max_length; bits != 0; bits --) {
<a class="jxr_linenumber" name="209" href="#209">209</a>             n = s.bl_count[bits];
<a class="jxr_linenumber" name="210" href="#210">210</a>             <strong class="jxr_keyword">while</strong> (n != 0) {
<a class="jxr_linenumber" name="211" href="#211">211</a>                 m = s.heap[-- h];
<a class="jxr_linenumber" name="212" href="#212">212</a>                 <strong class="jxr_keyword">if</strong> (m &gt; max_code) {
<a class="jxr_linenumber" name="213" href="#213">213</a>                     <strong class="jxr_keyword">continue</strong>;
<a class="jxr_linenumber" name="214" href="#214">214</a>                 }
<a class="jxr_linenumber" name="215" href="#215">215</a>                 <strong class="jxr_keyword">if</strong> (tree[m * 2 + 1] != bits) {
<a class="jxr_linenumber" name="216" href="#216">216</a>                     s.opt_len += ((<strong class="jxr_keyword">long</strong>) bits - (<strong class="jxr_keyword">long</strong>) tree[m * 2 + 1]) *
<a class="jxr_linenumber" name="217" href="#217">217</a>                             tree[m * 2];
<a class="jxr_linenumber" name="218" href="#218">218</a>                     tree[m * 2 + 1] = (<strong class="jxr_keyword">short</strong>) bits;
<a class="jxr_linenumber" name="219" href="#219">219</a>                 }
<a class="jxr_linenumber" name="220" href="#220">220</a>                 n --;
<a class="jxr_linenumber" name="221" href="#221">221</a>             }
<a class="jxr_linenumber" name="222" href="#222">222</a>         }
<a class="jxr_linenumber" name="223" href="#223">223</a>     }
<a class="jxr_linenumber" name="224" href="#224">224</a> 
<a class="jxr_linenumber" name="225" href="#225">225</a>     <em class="jxr_comment">// Construct one Huffman tree and assigns the code bit strings and lengths.</em>
<a class="jxr_linenumber" name="226" href="#226">226</a>     <em class="jxr_comment">// Update the total bit length for the current block.</em>
<a class="jxr_linenumber" name="227" href="#227">227</a>     <em class="jxr_comment">// IN assertion: the field freq is set for all tree elements.</em>
<a class="jxr_linenumber" name="228" href="#228">228</a>     <em class="jxr_comment">// OUT assertions: the fields len and code are set to the optimal bit length</em>
<a class="jxr_linenumber" name="229" href="#229">229</a>     <em class="jxr_comment">//     and corresponding code. The length opt_len is updated; static_len is</em>
<a class="jxr_linenumber" name="230" href="#230">230</a>     <em class="jxr_comment">//     also updated if stree is not null. The field max_code is set.</em>
<a class="jxr_linenumber" name="231" href="#231">231</a>     <strong class="jxr_keyword">void</strong> build_tree(<a href="../../../../../../org/jboss/netty/util/internal/jzlib/Deflate.html">Deflate</a> s) {
<a class="jxr_linenumber" name="232" href="#232">232</a>         <strong class="jxr_keyword">short</strong>[] tree = dyn_tree;
<a class="jxr_linenumber" name="233" href="#233">233</a>         <strong class="jxr_keyword">short</strong>[] stree = stat_desc.<strong class="jxr_keyword">static</strong>_tree;
<a class="jxr_linenumber" name="234" href="#234">234</a>         <strong class="jxr_keyword">int</strong> elems = stat_desc.elems;
<a class="jxr_linenumber" name="235" href="#235">235</a>         <strong class="jxr_keyword">int</strong> n, m; <em class="jxr_comment">// iterate over heap elements</em>
<a class="jxr_linenumber" name="236" href="#236">236</a>         <strong class="jxr_keyword">int</strong> max_code = -1; <em class="jxr_comment">// largest code with non zero frequency</em>
<a class="jxr_linenumber" name="237" href="#237">237</a>         <strong class="jxr_keyword">int</strong> node; <em class="jxr_comment">// new node being created</em>
<a class="jxr_linenumber" name="238" href="#238">238</a> 
<a class="jxr_linenumber" name="239" href="#239">239</a>         <em class="jxr_comment">// Construct the initial heap, with least frequent element in</em>
<a class="jxr_linenumber" name="240" href="#240">240</a>         <em class="jxr_comment">// heap[1]. The sons of heap[n] are heap[2*n] and heap[2*n+1].</em>
<a class="jxr_linenumber" name="241" href="#241">241</a>         <em class="jxr_comment">// heap[0] is not used.</em>
<a class="jxr_linenumber" name="242" href="#242">242</a>         s.heap_len = 0;
<a class="jxr_linenumber" name="243" href="#243">243</a>         s.heap_max = JZlib.HEAP_SIZE;
<a class="jxr_linenumber" name="244" href="#244">244</a> 
<a class="jxr_linenumber" name="245" href="#245">245</a>         <strong class="jxr_keyword">for</strong> (n = 0; n &lt; elems; n ++) {
<a class="jxr_linenumber" name="246" href="#246">246</a>             <strong class="jxr_keyword">if</strong> (tree[n * 2] != 0) {
<a class="jxr_linenumber" name="247" href="#247">247</a>                 s.heap[++ s.heap_len] = max_code = n;
<a class="jxr_linenumber" name="248" href="#248">248</a>                 s.depth[n] = 0;
<a class="jxr_linenumber" name="249" href="#249">249</a>             } <strong class="jxr_keyword">else</strong> {
<a class="jxr_linenumber" name="250" href="#250">250</a>                 tree[n * 2 + 1] = 0;
<a class="jxr_linenumber" name="251" href="#251">251</a>             }
<a class="jxr_linenumber" name="252" href="#252">252</a>         }
<a class="jxr_linenumber" name="253" href="#253">253</a> 
<a class="jxr_linenumber" name="254" href="#254">254</a>         <em class="jxr_comment">// The pkzip format requires that at least one distance code exists,</em>
<a class="jxr_linenumber" name="255" href="#255">255</a>         <em class="jxr_comment">// and that at least one bit should be sent even if there is only one</em>
<a class="jxr_linenumber" name="256" href="#256">256</a>         <em class="jxr_comment">// possible code. So to avoid special checks later on we force at least</em>
<a class="jxr_linenumber" name="257" href="#257">257</a>         <em class="jxr_comment">// two codes of non zero frequency.</em>
<a class="jxr_linenumber" name="258" href="#258">258</a>         <strong class="jxr_keyword">while</strong> (s.heap_len &lt; 2) {
<a class="jxr_linenumber" name="259" href="#259">259</a>             node = s.heap[++ s.heap_len] = max_code &lt; 2? ++ max_code : 0;
<a class="jxr_linenumber" name="260" href="#260">260</a>             tree[node * 2] = 1;
<a class="jxr_linenumber" name="261" href="#261">261</a>             s.depth[node] = 0;
<a class="jxr_linenumber" name="262" href="#262">262</a>             s.opt_len --;
<a class="jxr_linenumber" name="263" href="#263">263</a>             <strong class="jxr_keyword">if</strong> (stree != <strong class="jxr_keyword">null</strong>) {
<a class="jxr_linenumber" name="264" href="#264">264</a>                 s.<strong class="jxr_keyword">static</strong>_len -= stree[node * 2 + 1];
<a class="jxr_linenumber" name="265" href="#265">265</a>                 <em class="jxr_comment">// node is 0 or 1 so it does not have extra bits</em>
<a class="jxr_linenumber" name="266" href="#266">266</a>             }
<a class="jxr_linenumber" name="267" href="#267">267</a>         }
<a class="jxr_linenumber" name="268" href="#268">268</a>         <strong class="jxr_keyword">this</strong>.max_code = max_code;
<a class="jxr_linenumber" name="269" href="#269">269</a> 
<a class="jxr_linenumber" name="270" href="#270">270</a>         <em class="jxr_comment">// The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,</em>
<a class="jxr_linenumber" name="271" href="#271">271</a>         <em class="jxr_comment">// establish sub-heaps of increasing lengths:</em>
<a class="jxr_linenumber" name="272" href="#272">272</a> 
<a class="jxr_linenumber" name="273" href="#273">273</a>         <strong class="jxr_keyword">for</strong> (n = s.heap_len / 2; n &gt;= 1; n --) {
<a class="jxr_linenumber" name="274" href="#274">274</a>             s.pqdownheap(tree, n);
<a class="jxr_linenumber" name="275" href="#275">275</a>         }
<a class="jxr_linenumber" name="276" href="#276">276</a> 
<a class="jxr_linenumber" name="277" href="#277">277</a>         <em class="jxr_comment">// Construct the Huffman tree by repeatedly combining the least two</em>
<a class="jxr_linenumber" name="278" href="#278">278</a>         <em class="jxr_comment">// frequent nodes.</em>
<a class="jxr_linenumber" name="279" href="#279">279</a> 
<a class="jxr_linenumber" name="280" href="#280">280</a>         node = elems; <em class="jxr_comment">// next internal node of the tree</em>
<a class="jxr_linenumber" name="281" href="#281">281</a>         <strong class="jxr_keyword">do</strong> {
<a class="jxr_linenumber" name="282" href="#282">282</a>             <em class="jxr_comment">// n = node of least frequency</em>
<a class="jxr_linenumber" name="283" href="#283">283</a>             n = s.heap[1];
<a class="jxr_linenumber" name="284" href="#284">284</a>             s.heap[1] = s.heap[s.heap_len --];
<a class="jxr_linenumber" name="285" href="#285">285</a>             s.pqdownheap(tree, 1);
<a class="jxr_linenumber" name="286" href="#286">286</a>             m = s.heap[1]; <em class="jxr_comment">// m = node of next least frequency</em>
<a class="jxr_linenumber" name="287" href="#287">287</a> 
<a class="jxr_linenumber" name="288" href="#288">288</a>             s.heap[-- s.heap_max] = n; <em class="jxr_comment">// keep the nodes sorted by frequency</em>
<a class="jxr_linenumber" name="289" href="#289">289</a>             s.heap[-- s.heap_max] = m;
<a class="jxr_linenumber" name="290" href="#290">290</a> 
<a class="jxr_linenumber" name="291" href="#291">291</a>             <em class="jxr_comment">// Create a new node father of n and m</em>
<a class="jxr_linenumber" name="292" href="#292">292</a>             tree[node * 2] = (<strong class="jxr_keyword">short</strong>) (tree[n * 2] + tree[m * 2]);
<a class="jxr_linenumber" name="293" href="#293">293</a>             s.depth[node] = (byte) (Math.max(s.depth[n], s.depth[m]) + 1);
<a class="jxr_linenumber" name="294" href="#294">294</a>             tree[n * 2 + 1] = tree[m * 2 + 1] = (<strong class="jxr_keyword">short</strong>) node;
<a class="jxr_linenumber" name="295" href="#295">295</a> 
<a class="jxr_linenumber" name="296" href="#296">296</a>             <em class="jxr_comment">// and insert the new node in the heap</em>
<a class="jxr_linenumber" name="297" href="#297">297</a>             s.heap[1] = node ++;
<a class="jxr_linenumber" name="298" href="#298">298</a>             s.pqdownheap(tree, 1);
<a class="jxr_linenumber" name="299" href="#299">299</a>         } <strong class="jxr_keyword">while</strong> (s.heap_len &gt;= 2);
<a class="jxr_linenumber" name="300" href="#300">300</a> 
<a class="jxr_linenumber" name="301" href="#301">301</a>         s.heap[-- s.heap_max] = s.heap[1];
<a class="jxr_linenumber" name="302" href="#302">302</a> 
<a class="jxr_linenumber" name="303" href="#303">303</a>         <em class="jxr_comment">// At this point, the fields freq and dad are set. We can now</em>
<a class="jxr_linenumber" name="304" href="#304">304</a>         <em class="jxr_comment">// generate the bit lengths.</em>
<a class="jxr_linenumber" name="305" href="#305">305</a> 
<a class="jxr_linenumber" name="306" href="#306">306</a>         gen_bitlen(s);
<a class="jxr_linenumber" name="307" href="#307">307</a> 
<a class="jxr_linenumber" name="308" href="#308">308</a>         <em class="jxr_comment">// The field len is now set, we can generate the bit codes</em>
<a class="jxr_linenumber" name="309" href="#309">309</a>         gen_codes(tree, max_code, s.bl_count);
<a class="jxr_linenumber" name="310" href="#310">310</a>     }
<a class="jxr_linenumber" name="311" href="#311">311</a> 
<a class="jxr_linenumber" name="312" href="#312">312</a>     <em class="jxr_comment">// Generate the codes for a given tree and bit counts (which need not be</em>
<a class="jxr_linenumber" name="313" href="#313">313</a>     <em class="jxr_comment">// optimal).</em>
<a class="jxr_linenumber" name="314" href="#314">314</a>     <em class="jxr_comment">// IN assertion: the array bl_count contains the bit length statistics for</em>
<a class="jxr_linenumber" name="315" href="#315">315</a>     <em class="jxr_comment">// the given tree and the field len is set for all tree elements.</em>
<a class="jxr_linenumber" name="316" href="#316">316</a>     <em class="jxr_comment">// OUT assertion: the field code is set for all tree elements of non</em>
<a class="jxr_linenumber" name="317" href="#317">317</a>     <em class="jxr_comment">//     zero code length.</em>
<a class="jxr_linenumber" name="318" href="#318">318</a>     <strong class="jxr_keyword">private</strong> <strong class="jxr_keyword">static</strong> <strong class="jxr_keyword">void</strong> gen_codes(<strong class="jxr_keyword">short</strong>[] tree, <em class="jxr_comment">// the tree to decorate</em>
<a class="jxr_linenumber" name="319" href="#319">319</a>             <strong class="jxr_keyword">int</strong> max_code, <em class="jxr_comment">// largest code with non zero frequency</em>
<a class="jxr_linenumber" name="320" href="#320">320</a>             <strong class="jxr_keyword">short</strong>[] bl_count <em class="jxr_comment">// number of codes at each bit length</em>
<a class="jxr_linenumber" name="321" href="#321">321</a>     ) {
<a class="jxr_linenumber" name="322" href="#322">322</a>         <strong class="jxr_keyword">short</strong>[] next_code = <strong class="jxr_keyword">new</strong> <strong class="jxr_keyword">short</strong>[JZlib.MAX_BITS + 1]; <em class="jxr_comment">// next code value for each bit length</em>
<a class="jxr_linenumber" name="323" href="#323">323</a>         <strong class="jxr_keyword">short</strong> code = 0; <em class="jxr_comment">// running code value</em>
<a class="jxr_linenumber" name="324" href="#324">324</a>         <strong class="jxr_keyword">int</strong> bits; <em class="jxr_comment">// bit index</em>
<a class="jxr_linenumber" name="325" href="#325">325</a>         <strong class="jxr_keyword">int</strong> n; <em class="jxr_comment">// code index</em>
<a class="jxr_linenumber" name="326" href="#326">326</a> 
<a class="jxr_linenumber" name="327" href="#327">327</a>         <em class="jxr_comment">// The distribution counts are first used to generate the code values</em>
<a class="jxr_linenumber" name="328" href="#328">328</a>         <em class="jxr_comment">// without bit reversal.</em>
<a class="jxr_linenumber" name="329" href="#329">329</a>         <strong class="jxr_keyword">for</strong> (bits = 1; bits &lt;= JZlib.MAX_BITS; bits ++) {
<a class="jxr_linenumber" name="330" href="#330">330</a>             next_code[bits] = code = (<strong class="jxr_keyword">short</strong>) (code + bl_count[bits - 1] &lt;&lt; 1);
<a class="jxr_linenumber" name="331" href="#331">331</a>         }
<a class="jxr_linenumber" name="332" href="#332">332</a> 
<a class="jxr_linenumber" name="333" href="#333">333</a>         <em class="jxr_comment">// Check that the bit counts in bl_count are consistent. The last code</em>
<a class="jxr_linenumber" name="334" href="#334">334</a>         <em class="jxr_comment">// must be all ones.</em>
<a class="jxr_linenumber" name="335" href="#335">335</a>         <em class="jxr_comment">//Assert (code + bl_count[MAX_BITS]-1 == (1&lt;&lt;MAX_BITS)-1,</em>
<a class="jxr_linenumber" name="336" href="#336">336</a>         <em class="jxr_comment">//        "inconsistent bit counts");</em>
<a class="jxr_linenumber" name="337" href="#337">337</a>         <em class="jxr_comment">//Tracev((stderr,"\ngen_codes: max_code %d ", max_code));</em>
<a class="jxr_linenumber" name="338" href="#338">338</a> 
<a class="jxr_linenumber" name="339" href="#339">339</a>         <strong class="jxr_keyword">for</strong> (n = 0; n &lt;= max_code; n ++) {
<a class="jxr_linenumber" name="340" href="#340">340</a>             <strong class="jxr_keyword">int</strong> len = tree[n * 2 + 1];
<a class="jxr_linenumber" name="341" href="#341">341</a>             <strong class="jxr_keyword">if</strong> (len == 0) {
<a class="jxr_linenumber" name="342" href="#342">342</a>                 <strong class="jxr_keyword">continue</strong>;
<a class="jxr_linenumber" name="343" href="#343">343</a>             }
<a class="jxr_linenumber" name="344" href="#344">344</a>             <em class="jxr_comment">// Now reverse the bits</em>
<a class="jxr_linenumber" name="345" href="#345">345</a>             tree[n * 2] = (<strong class="jxr_keyword">short</strong>) bi_reverse(next_code[len] ++, len);
<a class="jxr_linenumber" name="346" href="#346">346</a>         }
<a class="jxr_linenumber" name="347" href="#347">347</a>     }
<a class="jxr_linenumber" name="348" href="#348">348</a> 
<a class="jxr_linenumber" name="349" href="#349">349</a>     <em class="jxr_comment">// Reverse the first len bits of a code, using straightforward code (a faster</em>
<a class="jxr_linenumber" name="350" href="#350">350</a>     <em class="jxr_comment">// method would use a table)</em>
<a class="jxr_linenumber" name="351" href="#351">351</a>     <em class="jxr_comment">// IN assertion: 1 &lt;= len &lt;= 15</em>
<a class="jxr_linenumber" name="352" href="#352">352</a>     <strong class="jxr_keyword">private</strong> <strong class="jxr_keyword">static</strong> <strong class="jxr_keyword">int</strong> bi_reverse(<strong class="jxr_keyword">int</strong> code, <em class="jxr_comment">// the value to invert</em>
<a class="jxr_linenumber" name="353" href="#353">353</a>             <strong class="jxr_keyword">int</strong> len <em class="jxr_comment">// its bit length</em>
<a class="jxr_linenumber" name="354" href="#354">354</a>     ) {
<a class="jxr_linenumber" name="355" href="#355">355</a>         <strong class="jxr_keyword">int</strong> res = 0;
<a class="jxr_linenumber" name="356" href="#356">356</a>         <strong class="jxr_keyword">do</strong> {
<a class="jxr_linenumber" name="357" href="#357">357</a>             res |= code &amp; 1;
<a class="jxr_linenumber" name="358" href="#358">358</a>             code &gt;&gt;&gt;= 1;
<a class="jxr_linenumber" name="359" href="#359">359</a>             res &lt;&lt;= 1;
<a class="jxr_linenumber" name="360" href="#360">360</a>         } <strong class="jxr_keyword">while</strong> (-- len &gt; 0);
<a class="jxr_linenumber" name="361" href="#361">361</a>         <strong class="jxr_keyword">return</strong> res &gt;&gt;&gt; 1;
<a class="jxr_linenumber" name="362" href="#362">362</a>     }
<a class="jxr_linenumber" name="363" href="#363">363</a> }
</pre>
<hr/><div id="footer">This page was automatically generated by <a href="http://maven.apache.org/">Maven</a></div></body>
</html>

